A Tutorial on GrÖbner Bases With Applications in Signals and Systems

This paper is a tutorial on GrÖbner bases and a survey on the applications of GrÖbner bases in the broad field of signals and systems. A reasonably detailed review is given of several fundamental theoretical issues that occur in the use of GrÖbner bases in multidimensional signals and systems applications. These topics include the primeness of multivariate polynomial matrices, multivariate unimodular polynomial matrix completion, and prime factorization of multivariate polynomial matrices. A brief review is also presented on the wide-ranging applications of GrÖbner bases in multidimensional as well as one-dimensional circuits, networks, control, coding, signals, and systems and other related areas like robotics and applied mechanics. The impact and scope of GrÖbner bases in signals and systems are highlighted with respect to what has already been accomplished as a stepping stone to expanding future research.      

海上油气田的废弃处置

废弃处置是油气田开发的最终环节 ,海上油气田的废弃处置在国内外都是一个新的领域。在对国内外相关文献分析的基础上 ,结合开发工程方面的经验 ,介绍海上油气田废弃处置的标准 ,相关的领域以及废弃处置的过程和方法     

Power Distribution Fault Cause Identification With Imbalanced Data Using the Data Mining-Based Fuzzy Classification E-Algorithm

Power distribution systems have been significantly affected by many outage-causing events. Good fault cause identification can help expedite the restoration procedure and improve the system reliability. However, the data imbalance issue in many real-world data sets often degrades the fault cause identification performance. In this paper, the E-algorithm, which is extended from the fuzzy classification algorithm by Ishibuchi to alleviate the effect of imbalanced data constitution, is applied to Duke Energy outage data for distribution fault cause identification. Three major outage causes (tree, animal, and lightning) are used as prototypes. The performance of E-algorithm on real-world imbalanced data is compared with artificial neural network. The results show that the E-algorithm can greatly improve the performance when the data are imbalanced     

分置式牛津型斯特林制冷机的数值分析与实验验证

对分置式牛津型斯特林制冷机进行了数值计算 ,介绍了计算模型考虑到的众多不可逆因素。通过对计算结果与实验结果的对比 ,验证了本文数值计算的准确性 ,说明本文计算模型与数值处理方法是切实可行的     

透反液晶显示器

兼有透射型和反射型液晶显示优点的透反液晶显示可工作于透射和反射两种显示模式，它将广泛应用于手机、PDA等通讯领域。透反液晶显示可分为单盒厚和双盒厚两大类。又可分为扭曲型和非扭曲型两种。为了研制出高性能透反液晶显示器，需解决透反两个显示区的响应时间、光效率、色饱和度的差异以及视角等问题。文中介绍了Sharp公司开发的2种基本的透反液晶显示。以及3种新近开发的高性能透反液晶显示。随着应用市场的扩大和技术的进步，透反液晶显示将会进一步得到发展。     

幅频特性的数学分析

根据数控装置检测系统中传感器信号电路工作要求,以共射电压放大电路为例,分别考虑耦合电容、旁路电容、结间电容和分布电容对不同信号频率的作用,分析了电路的低频特性和高频特性,给出了上下限截止频率的解析式.由此得出,电路其他参数一定时,在低频段,下限截止频率与耦合电容、旁路电容成反比,在高频段,上限截止频率与等效输入输出电容成反比,从而为传感器系统设计提供理论依据.     

Mapping rule-based systems onto multicomputers using simulated annealing

In this paper, we present a static load balancing method for mapping production rules in an expert system onto processors of a message-passing multicomputer. The method uses simulated annealing to achieve a nearly optimal allocation of production rules onto processor nodes. The approach balances the initial rule distribution to avoid higher communication demand among processor nodes at run time. A formal mapping model is developed and a new cost function is defined for the annealing process. New heuristic swap functions and cooling policies are provided to ensure the quality of the annealing process. A software load balancing package, SIMAL, was implemented on a SUN workstation to carry out the benchmark experiments. The overhead associated with this mapping method is O(m In m), where m is the number of rules in the production system. Two benchmark production systems, Toru-waltz and Tourney, are mapped onto a hypercube computer with 32 nodes. Experimental benchmark results verify the effectiveness of the rule mapping method. The method can be applied for distributed artificial intelligence processing or for the parallel execution of cooperating expert systems on a message-passing multicomputer.     

Perturbation analysis and control of two-class stochastic fluid models for communication networks

This paper uses stochastic fluid models (SFMs) for the control and optimization (rather than performance analysis) of communication network nodes processing two classes of traffic: one is uncontrolled and the other is subject to threshold-based buffer control. We derive gradient estimators for packet loss and workload related performance metrics with respect to threshold parameters. These estimators are shown to be unbiased and directly observable from a sample path without any knowledge of underlying stochastic characteristics of the traffic processes. This renders them computable in online environments and easily implementable for network management and control. We further demonstrate their use in buffer control problems where our SFM-based estimators are evaluated based on data from an actual system.     

Stabilization Methods for Spectral Element Computations of Incompressible Flows

A stabilization method for the spectral element computation of incompressible flow problems is investigated. It is based on a filtering procedure which consists in filtering the velocity field by a spectral vanishing Helmholtz-type operator at each time step. Relationship between this filtering procedure and SVV-stabilization method, introduced recently in [JCP, 2004, 196(2), p680], is established. A number of numerical examples are presented to show the accuracy and stabilization capability of the method.     

Fixed point theorem-based iterative learning control for LTV systems with input singularity

In this paper, we address a challenging and open problem: how to design a suitable iterative learning control (ILC) system in the presence of input singularity, which is incurred by the singularities of the system direct feed-through term. Considering two typical types of input singularities, we first revise the ILC operators accordingly by adding a forgetting factor and incorporating a time-varying learning gain, in the sequel guarantee ILC operators to be contractible. Next, using the Banach fixed-point theorem, we demonstrate that the output sequence can either enter and remains ultimately in a designated neighborhood of the target trajectory, or is bounded by a class K function. Finally, an illustrative example is presented.